On the crossing numbers of certain generalized Petersen graphs

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the crossing numbers of certain generalized Petersen graphs

McQuillan, D. and R.B. Richter, On the crossing numbers of certain generalized Petersen graphs, Discrete Mathematics 104 (1992) 311-320. In his paper on the crossing numbers of generalized Petersen graphs, Fiorini proves that P(8, 3) has crossing number 4 and claims at the end that P(10, 3) also has crossing number 4. In this article, we give a short proof of the first claim and show that the s...

متن کامل

Graceful labelings of the generalized Petersen graphs

A graceful labeling of a graph $G=(V,E)$ with $m$ edges is aninjection $f: V(G) rightarrow {0,1,ldots,m}$ such that the resulting edge labelsobtained by $|f(u)-f(v)|$ on every edge $uv$ are pairwise distinct. For natural numbers $n$ and $k$, where $n > 2k$, a generalized Petersengraph $P(n, k)$ is the graph whose vertex set is ${u_1, u_2, cdots, u_n} cup {v_1, v_2, cdots, v_n}$ and its edge set...

متن کامل

Distinguishing and Distinguishing Chromatic Numbers of Generalized Petersen Graphs

Albertson and Collins defined the distinguishing number of a graph to be the smallest number of colors needed to color its vertices so that the coloring is preserved only by the identity automorphism. Collins and Trenk followed by defining the distinguishing chromatic number of a graph to be the smallest size of a coloring that is both proper and distinguishing. We show that, with two exception...

متن کامل

Optimal Generalized Petersen Graphs

In this paper we establish a theorem on the maximum number of vertices of a generalized Petersen graph as a function of the diameter.

متن کامل

Generalizing the generalized Petersen graphs

The generalized Petersen graphs (GPGs) which have been invented by Watkins, may serve for perhaps the simplest nontrivial examples of “galactic” graphs, i.e. those with a nice property of having a semiregular automorphism. Some of them are also vertextransitive or even more highly symmetric, and some are Cayley graphs. In this paper, we study a further extension of the notion of GPGs with the e...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Mathematics

سال: 1992

ISSN: 0012-365X

DOI: 10.1016/0012-365x(92)90453-m